Risk minimization by median-of-means tournaments
نویسندگان
چکیده
منابع مشابه
2 A ug 2 01 6 Risk minimization by median - of - means tournaments ∗
We consider the classical statistical learning/regression problem, when the value of a real random variable Y is to be predicted based on the observation of another random variableX . Given a class of functions F and a sample of independent copies of (X,Y ), one needs to choose a function f̂ from F such that f̂(X) approximates Y as well as possible, in the mean-squared sense. We introduce a new p...
متن کاملMONK - Outlier-Robust Mean Embedding Estimation by Median-of-Means
Mean embeddings provide an extremely flexible and powerful tool in machine learning and statistics to represent probability distributions and define a semi-metric (MMD, maximum mean discrepancy; also called N-distance or energy distance), with numerous successful applications. The representation is constructed as the expectation of the feature map defined by a kernel. As a mean, its classical e...
متن کاملPortfolio Optimization Based on Cross Efficiencies By Linear Model of Conditional Value at Risk Minimization
Markowitz model is the first modern formulation of portfolio optimization problem. Relyingon historical return of stocks as basic information and using variance as a risk measure aretow drawbacks of this model. Since Markowitz model has been presented, many effortshave been done to remove theses drawbacks. On one hand several better risk measures havebeen introduced and proper models have been ...
متن کاملMedian Variant of Fuzzy c-Means
In this paper we introduce Median Fuzzy C-Means (MFCM). This algorithm extends the Median C-Means (MCM) algorithm by allowing fuzzy values for the cluster assignments. To evaluate the performance of M-FCM, we compare the results with the clustering obtained by employing MCM and Median Neural Gas (MNG).
متن کاملSports tournaments, home-away assignments, and the break minimization problem
We consider the break minimization problem for fixing home-away assignments in round-robin sports tournaments. First, we show that for an opponent schedule with n teams and n− 1 rounds, there always exists a home-away assignment with at most 1 4n(n−2) breaks. Secondly, for infinitely many n, we construct opponent schedules for which at least 6n(n−1) breaks are necessary. Finally, we prove that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the European Mathematical Society
سال: 2019
ISSN: 1435-9855
DOI: 10.4171/jems/937